package ink.lovejinhu.leetcode;

import ink.lovejinhu.common.ListNode;

/**
 * @author jinhu
 * created 2021-04-29 6:21
 */
public class Solution_0021 {
    /**
     * 链表有序的(升序)
     *
     * @param l1
     * @param l2
     * @return
     */
    public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
        if (l1 == null) {
            return l2;
        }
        if (l2 == null) {
            return l1;
        }
        /**
         * 如何不引入临时变量
         */

        while (l1.next != null || l2.next != null) {

        }
        return null;
    }
}
